#include <bits/stdc++.h>

using namespace std;

// Source: https://github.com/atcoder/ac-library

struct dsu {
public:
    dsu() : _n(0) {}
    explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y)
            return x;
        if (-parent_or_size[x] < -parent_or_size[y])
            std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0)
            return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; ++i) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; ++i) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; ++i) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(std::remove_if(
                             result.begin(), result.end(),
                             [&](const std::vector<int>& v) { return v.empty(); }),
                     result.end());
        return result;
    }

private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};
class Solution {
public:
    int countComponents(vector<int>& A, int t) {
        vector<int> s, l;
        for (auto a : A) {
            if (a <= t)
                s.push_back(a);
            else
                l.push_back(a);
        }
        int ns = s.size(), nl = l.size();
        if (ns == 0)
            return nl;
        vector<int> m(t + 1, -1);
        for (int i = 0; i < ns; ++i)
            m[s[i]] = i;
        dsu d(ns);
        vector groups(t + 1, vector<int>());
        for (auto a : s) {
            for (int m_val = a; m_val <= t; m_val += a) {
                groups[m_val].push_back(a);
            }
        }
        for (int k = 1; k <= t; k++) {
            if (groups[k].size() >= 2) {
                int f = m[groups[k][0]];
                for (int i = 1; i < groups[k].size(); ++i)
                    d.merge(f, m[groups[k][i]]);
            }
        }
        unordered_set<int> p_set;
        for (int i = 0; i < ns; ++i)
            p_set.insert(d.leader(i));
        return p_set.size() + nl;
    }
};